Optimizing budget allocation for center and median points
نویسندگان
چکیده
منابع مشابه
Optimizing budget allocation for center and median points
Article history: Received 9 August 2015 Received in revised form 3 February 2016 Accepted 12 February 2016 Available online 17 February 2016 Communicated by A. Marchetti-Spaccamela
متن کاملOptimizing Budget Allocation in Graphs
In a classical facility location problem we consider a graph G with fixed weights on the edges of G. The goal is then to find an optimal positioning for a set of facilities on the graph with respect to some objective function. We introduce a new framework for facility location problems, where the weights on the graph edges are not fixed, but rather should be assigned. The goal is to find the va...
متن کاملThe p-median and p-center Problems on Bipartite Graphs
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...
متن کاملa benchmarking approach to optimal asset allocation for insurers and pension funds
uncertainty in the financial market will be driven by underlying brownian motions, while the assets are assumed to be general stochastic processes adapted to the filtration of the brownian motions. the goal of this study is to calculate the accumulated wealth in order to optimize the expected terminal value using a suitable utility function. this thesis introduced the lim-wong’s benchmark fun...
15 صفحه اولOptimal Computing Cost Budget Allocation For Solving Buffer Allocation Problem
In this paper, we study the problem of selecting a system that has the best performance or selecting one of the best systems when the objective function is the expected performance of a complex stochastic system. The focus here is on a huge size but finite feasible solution set, that is not necessarily well structured. We consider the use of the ordinal optimization technique that concerns with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.02.013